Finding the shortest boundary guard of a simple polygon
نویسندگان
چکیده
There are many di-erent kinds of guards in a simple polygon that have been proposed and discussed. In this paper, we consider a new type of guard, boundary guard, which is a guard capable of moving along a boundary of a polygon and every interior point of the polygon can be seen by the mobile guard. We propose an algorithm to 1nd the shortest boundary guard of a simple polygon P in O(n log n) time, where n is the number of vertices of P. c © 2001 Published by Elsevier Science B.V.
منابع مشابه
Guarding Path Polygons with Orthogonal Visibility
We are interested in the problem of guarding simple orthogonal polygons with the minimum number of r-guards. The interior point p belongs an orthogonal polygon P is visible from r-guard g, if the minimum area rectangle contained p and q lies within P . A set of point guards in polygon P is named guard set (as denoted G) if the union of visibility areas of these point guards be equal to polygon ...
متن کاملOptimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the guards must move along the boundary of the room and eventually meet again. We give polynomial time algorithms for finding a search schedule that minimizes the total distance travelled by the guards and for minimizing the...
متن کاملAlgorithms for Optimizing Search Schedules in a Polygon
In the area of motion planning, considerable work has been done on guarding problems, where “guards”, modelled as points, must guard a polygonal space from “intruders”. Different variants of this problem involve varying a number of factors. The guards performing the search may vary in terms of their number, their mobility, and their range of vision. The model of intruders may or may not allow t...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملMulti-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex hull of the guards from which it is visible. The definition captures our desire that guards both “see” and “surround” points that they cover. Guards move along continuous timeparameterized curves within a polygonal re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2001